Two Signed Associahedra

نویسنده

  • V. Reiner
چکیده

The associahedron is a convex polytope whose vertices correspond to triangulations of a convex polygon. We define two signed or hyperoctahedral analogues of the associahedron, one of which is shown to be a simple convex polytope, and the other a regular CW-sphere.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Combinatorics of Minkowski decomposition of associahedra

Realisations of associahedra can be obtained from the classical permutahedron by removing some of its facets and the set of these facets is determined by the diagonals of certain labeled convex planar n-gons as shown by Hohlweg and Lange (2007). Ardila, Benedetti, and Doker (2010) expressed polytopes of this type as Minkowski sums and differences of dilated faces of a standard simplex and compu...

متن کامل

Signed tree associahedra

Spines T a tree on a signed ground set V = V− t V. Spine on T = directed and labeled tree S such that • the labels of the nodes of S form a partition of the signed ground set V, • at a node labeled by U = U− t U, the source label sets of the incoming arcs are subsets of distinct connected components of TrU−, and the sink label sets of the outgoing arcs are subsets of distinct connected componen...

متن کامل

Graph Properties of Graph Associahedra

A graph associahedron is a simple polytope whose face lattice encodes the nested structure of the connected subgraphs of a given graph. In this paper, we study certain graph properties of the 1-skeleta of graph associahedra, such as their diameter and their Hamiltonicity. Our results extend known results for the classical associahedra (path associahedra) and permutahedra (complete graph associa...

متن کامل

Enumerative properties of generalized associahedra

Some enumerative aspects of the fans called generalized associahedra, introduced by S. Fomin and A. Zelevinsky in their theory of cluster algebras, are considered in relation with a bicomplex and its two spectral sequences. A precise enumerative relation with the lattices of generalized noncrossing partitions is conjectured and some evidence is given.

متن کامل

The diameter of type D associahedra and the non-leaving-face property

Generalized associahedra were introduced by S. Fomin and A. Zelevinsky in connection to finite type cluster algebras. Following recent work of L. Pournin in types A and B, this paper focuses on geodesic properties of generalized associahedra. We prove that the graph diameter of the n-dimensional associahedron of type D is precisely 2n − 2 for all n greater than 1. Furthermore, we show that all ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998